Symbolic Reasoning by Diierence Reduction
نویسندگان
چکیده
We present a new approach to automated reasoning based on di erence identi cation and reduction. Di erence identi cation is based on a generalization of uni cation so that terms are made equal not only by nding substitutions for variables but also by hiding term structure. This annotation of structural di erences serves to direct rippling, a type of rewriting designed to reduce and remove di erences in a controlled way. On the technical side, we give a rule-based algorithm for di erence uni cation, and analyze its correctness, completeness, and complexity. Moreover we show how it can be e ciently implemented based on a novel search strategy for uni ers. On the practical side, we show how this algorithm can be used in new ways to support and extend the role of rippling in theorem proving and other kinds of automated reasoning.
منابع مشابه
Symbolic Program Analysis and Optimization for Parallelizing Compilers
A program ow analysis framework is proposed for parallelizing compilers. Within this framework, symbolic analysis is used as an abstract interpretation technique to solve many of the ow analysis problems in a uniied way. Some of these problems are constant propagation , global forward substitution, detection of loop invariant computations, and induction variable substitution. The solution space...
متن کاملDiierence Matching
Diierence matching is a generalization of rst-order matching where terms are made identical both by variable instantiation and by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest of the term unaltered. Rippling has proved highly successful in inductive theorem proving. Diierence matching allows us to u...
متن کاملFrom Gameplay to Symbolic Reasoning: Learning SAT Solver Heuristics in the Style of Alpha(Go) Zero
Despite the recent successes of deep neural networks in various fields such as image and speech recognition, natural language processing, and reinforcement learning, we still face big challenges in bringing the power of numeric optimization to symbolic reasoning. Researchers have proposed different avenues such as neural machine translation for proof synthesis, vectorization of symbols and expr...
متن کاملComparative study of Symbolic Reasoning and Statistical Reasoning
This paper examines reasoning under certainty by symbolic and statistical methods and the comparison between these two methods. Basically reasoning is a process of logically arguing and drawing inference. For reasoning, the system must find out what it needs to know from what it already knows. In this paper we review symbolic reasoning and different methods of statistical reasoning like probabi...
متن کاملRough sets approach to symbolic value partition
Symbolic value partition refers to the problem of dividing each attribute domain of a data table into a family of disjoint subsets. It could help obtaining a new data table with less attributes and smaller attribute domains, thus facilitating further machine learning processing. The optimal symbolic value partition (OSVP) problem of supervised data, where the optimal metric is defined by the ca...
متن کامل